The Earliest Deadline First Scheduling with Active Buffer Management for Real-Time Traffic in the Internet

نویسندگان

  • Xiaojun Hei
  • Danny H. K. Tsang
چکیده

We study the problem of QoS guarantee for di erentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traÆc. We propose to employ an EDF scheduler combined with an active bu er management scheme (CHOKe) to improve the fairness of resource allocation and to maintain a good delay performance for all real-time applications. Simulation results show that the proposed scheme can achieve a better delay performance and make a more fair bandwidth allocation between the real-time TCP and UDP connections than the First Come First Serve (FCFS) scheduling with the Drop-Tail bu er management which is commonly deployed in the traditional IP router. Keyword: Scheduling, Earliest Deadline First, Active Bu er Management, Real-time TraÆc

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

متن کامل

QoS Support for Real-Time Flows in Internet Routers

This paper addresses how to offer a specific QoS for soft-real time distributed applications over the Internet. The approach here proposed is entrusting the routers with the task of providing diversified scheduling for real-time and non-real-time flows, keeping the two types of traffic into separate queues and applying a deadline-based scheduling to real-time flows and a FIFO policy to non-real...

متن کامل

Guaranteed Real-Time Services in Switched Ethernet Networks with Deadline Scheduling in the End Nodes

This paper proposes a switched Ethernet network that supports real-time communication with guaranteed bit rate and end-to-end delay bound. In our proposal, the source nodes use Earliest Deadline First (EDF) scheduling, while the switch uses First Come First Served (FCFS) to control periodic real-time traffic belonging to logical realtime connections. The schedulability condition is drawn and th...

متن کامل

A Finite Buffer Scheduling Scheme with Statistical Guarantee for Vbr Traffic in Atm Networks

Future ATM networks will support real-time voice and video services and we need to guarantee cell transfer delay and cell loss probability to launch such services. The Earliest Deadline First (EDF) scheme is a suitable service scheduling scheme for these services since it has been proven that it can minimize the number of late cells by assigning deadlines to the cells. However, the EDF scheme c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001